翻訳と辞書 |
Generalized inversive congruential pseudorandom numbers : ウィキペディア英語版 | Generalized inversive congruential pseudorandom numbers An approach to nonlinear congruential methods of generating uniform pseudorandom numbers in the interval [0,1) is the Inversive congruential generator with prime modulus. A generalization for arbitrary composite moduli with arbitrary distinct primes will be present here. Let .For integers with gcd (a,m) = 1 a generalized inversive congruential sequence of elements of is defined by : : where denotes the number of positive integers less than ''m'' which are relatively prime to ''m''. ==Example==
Let take m = 15 = and . Hence and the sequence is not maximum. The result below shows that these sequences are closely related to the following inversive congruential sequence with prime moduli. For let and Let be a sequence of elements of
抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Generalized inversive congruential pseudorandom numbers」の詳細全文を読む
スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|